Priority Inheritance and Ceilings for Distributed Mutual Exclusion
نویسنده
چکیده
The contributions of this paper are threefold. First, a solution to the problem of prioritized mutual exclusion in a distributed system is proved correct. This protocol is based on fewer requirements than prioritized extensions of other protocols and outperforms other protocols with an average complexity of (log n) and a worst-case complexity of O(n) messages for n nodes. Second, the concept of relative fairness is introduced, which quantifies the relation between parallel events in terms of their ordering in the absence of synchronized clocks. This concept is applied to the protocol in order to determine a requirement to guarantee a certain order between events when message delays are bounded. Third, the protocol is extended to prevent priority inversion by incorporating the priority inheritance and the priority ceiling protocols. The extensions are shown to integrate well with the original protocol. They impose the same message overhead as mentioned before for each dynamically raised priority due to resource contention while early priority boosting, such as for the priority ceiling emulation protocol, requires no additional overhead at all.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملControl for Dynamic Priority Distributed Real - Time Systems
Many of today’s complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this demand, the Object Management Group’s (OMG) Real-Time Special Interest Group (RT SIG) has worked to extend the Common Object Request Broker Architecture (CORBA) standard to include real-time specifications. This group’s most r...
متن کاملPriority Inheritance on Condition Variables
In this paper, a mechanism is presented to deal with priority inversion in real-time systems when multiple threads of execution synchronize with each other by means of mutual exclusion semaphores coupled with the programming abstraction of condition variables. Traditional priority inheritance solutions focus on addressing priority or deadline inversion as due to the attempt to lock mutual exclu...
متن کاملImprovement of the distributed algorithms of mutual exclusion by introducing the priority
Most of distributed mutual exclusion algorithms do not use the notion of priority. To solve the distributed prioritized mutual exclusion problem, F. Mueller[9] has already prioritized a token and tree based algorithm. The goal of this paper is to show the introduction of priority in an other token-based algorithm. This work can be considered an improvement of F.
متن کاملAn Improved Priority Ceiling Protocol to Reduce Context Switches in Task Synchronization
Context switching between concurrent tasks is a pure operating system overhead which wastes CPU cycles. This paper describes a technique to reduce the number of context switches which are caused by task synchronization. Our method disallows a higherpriority task to preemptively seize the CPU if it will be blocked by a lower-priority task in the future. This protocol is applicable to real-time s...
متن کامل